A Directed Signature Scheme Based on RSA Assumption

نویسندگان

  • Rongxing Lu
  • Zhenfu Cao
چکیده

A directed signature scheme allows a designated verifier to directly verify a signature issued to him, and a third party to check the signature validity with the help of the signer or the designated verifier as well. Due to its merits, the directed signature scheme can be applied on some personally or commercially sensitive occasions. Up to now, there are several directed signature schemes having been proposed. However, to our best knowledge, none of them has provided the provable security proof. Therefore, in this paper, we would like to formally define the directed signature, and present a new directed signature scheme based on RSA assumption, then use the techniques from provable security to analyze the security of our proposed scheme.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double voter perceptible blind signature based electronic voting protocol

Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...

متن کامل

Verifiable Signature Sharing Scheme Based on Strong RSA Assumption

In 2000, Cramer and Shoup presented a signature scheme which is secure against adaptive chosen-message attacks under the strong RSA assumption in the standard model. Then, in 2003, under the strong RSA assumption only, Fischlin produced a signature of roughly half the length. A verifiable signature sharing scheme (VΣS) introduced by Franklin and Reiter in 1995 enables the recipient of a signatu...

متن کامل

Short Signatures Without Random Oracles

We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes withou...

متن کامل

A Practical and Tightly Secure Signature Scheme Without Hash Function

In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the Cramer-Shoup (CS) signature scheme. Remarkably, these schemes meet the highest security notion in the standard model. They however differ in their implementation. The CS scheme and its subsequent variants and extensio...

متن کامل

Signature Schemes Based on the Strong RSAAssumptionRonald

We describe and analyze a new digital signature scheme. The new scheme is quite eecient, does not require the the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called Strong RSA Assumption. Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2006